The constant of recognizability is computable for primitive morphisms
نویسندگان
چکیده
Mossé proved that primitive morphisms are recognizable. In this paper we give a computable upper bound for the constant of recognizability of such a morphism. This bound can be expressed only using the cardinality of the alphabet and the length of the longest image under the morphism of a letter.
منابع مشابه
Recognizability for Sequences of Morphisms
We investigate different notions of recognizability for a free monoid morphism σ : A∗ → B∗. Full recognizability occurs when each (aperiodic) point in BZ admits at most one tiling with words σ(a), a ∈ A. This is stronger than the classical notion of recognizability of a substitution σ : A∗ → A∗, where the tiling must be compatible with the language of the substitution. We show that if |A| = 2, ...
متن کاملOverlapping Tile Automata
Premorphisms are monotonic mappings between partially ordered monoids where the morphism condition φ(xy) = φ(x)φ(y) is relaxed into the condition φ(xy) ≤ φ(x)φ(y). Their use in place of morphisms has recently been advocated in situations where classical algebraic recognizability collapses. With languages of overlapping tiles, an extension of classical recognizability by morphisms, called quasi-...
متن کاملRational Periodic Points for Degree Two Polynomial Morphisms on Projective Space
This article addresses the existence of Q-rational periodic points for morphisms of projective space. In particular, we construct an infinitely family of morphisms on P where each component is a degree 2 homogeneous form in N+1 variables which has a Q-periodic point of primitive period (N+1)(N+2) 2 + ̈ N−1 2 ̋ . This result is then used to show that for N large enough there exists morphisms of P ...
متن کاملOn B. Mossé's unilateral recognizability theorem
We complete statement and proof for B. Mossé’s unilateral recognizability theorem. We also provide an algorithm for deciding the unilateral non-recognizability of a given primitive substitution.
متن کاملOptimal Results on Recognizability for Infinite Time Register Machines
Exploring further the properties of ITRM -recognizable reals started in [Ca], we provide a detailed analysis of recognizable reals and their distribution in Gödels constructible universe L. In particular, we show that new unrecognizables are generated at every index γ ≥ ω ω . We give a machine-independent characterization of recognizability by proving that a real r is recognizable iff it is Σ1-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1610.05577 شماره
صفحات -
تاریخ انتشار 2016